K-harmonic Means Data Clustering with Imperialist Competitive Algorithm
نویسندگان
چکیده
Data clustering is one of the most important tasks of data mining. This paper aims to describe an integrated data clustering method based on Imperialist Competitive Algorithm (ICA) and K-Harmonic Means (KHM) algorithm. The proposed method is called ICA-KHM. KHM is a well-known clustering method and its main drawback is to converge to local optimums. Imperialist competitive algorithm is an evolutionary global search and optimization algorithm inspired by socio-political process of imperialistic competition. ICA has high convergence rate and can be used to solve optimization problems with multiple local minima. The proposed method combined the advantageous aspects of ICA and KHM in data clustering process. The proposed method is evaluated on five well-known datasets from different domains, and compared with KHM, and ICA. The experimental results indicate that the ICA-KHM provides better results than the two other methods.
منابع مشابه
Identifying Flow Units Using an Artificial Neural Network Approach Optimized by the Imperialist Competitive Algorithm
The spatial distribution of petrophysical properties within the reservoirs is one of the most important factors in reservoir characterization. Flow units are the continuous body over a specific reservoir volume within which the geological and petrophysical properties are the same. Accordingly, an accurate prediction of flow units is a major task to achieve a reliable petrophysical description o...
متن کاملImage Segmentation using Improved Imperialist Competitive Algorithm and a Simple Post-processing
Image segmentation is a fundamental step in many of image processing applications. In most cases the image’s pixels are clustered only based on the pixels’ intensity or color information and neither spatial nor neighborhood information of pixels is used in the clustering process. Considering the importance of including spatial information of pixels which improves the quality of image segmentati...
متن کاملAn efficient hybrid algorithm based on modified imperialist competitive algorithm and K-means for data clustering
Clustering techniques have received attention in many fields of study such as engineering, medicine, biology and data mining. The aim of clustering is to collect data points. The K-means algorithm is one of the most common techniques used for clustering. However, the results of K-means depend on the initial state and converge to local optima. In order to overcome local optima obstacles, a lot o...
متن کاملخوشهبندی خودکار دادهها با بهرهگیری از الگوریتم رقابت استعماری بهبودیافته
Imperialist Competitive Algorithm (ICA) is considered as a prime meta-heuristic algorithm to find the general optimal solution in optimization problems. This paper presents a use of ICA for automatic clustering of huge unlabeled data sets. By using proper structure for each of the chromosomes and the ICA, at run time, the suggested method (ACICA) finds the optimum number of clusters while optim...
متن کاملMulti-layer Clustering Topology Design in Densely Deployed Wireless Sensor Network using Evolutionary Algorithms
Due to the resource constraint and dynamic parameters, reducing energy consumption became the most important issues of wireless sensor networks topology design. All proposed hierarchy methods cluster a WSN in different cluster layers in one step of evolutionary algorithm usage with complicated parameters which may lead to reducing efficiency and performance. In fact, in WSNs topology, increasin...
متن کامل